Equivalent forms for a poset to be modular poset
نویسندگان
چکیده
منابع مشابه
Poset Limits Can Be Totally Ordered
S. Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529–563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a kernel on the unit interval with the standard order, thus answering an open question of Janson. We provide two proofs: real-analytic and combinatorial. The co...
متن کاملA Finite Word Poset
Our word posets have finite words of bounded length as their elements, with the words composed from a finite alphabet. Their partial ordering follows from the inclusion of a word as a subsequence of another word. The elemental combinatorial properties of such posets are established. Their automorphism groups are determined (along with similar result for the word poset studied by Burosch, Frank ...
متن کاملA Voronoi Poset
Given a set S of n points in general position, we consider all k-th order Voronoi diagrams on S, for k = 1, . . . , n, simultaneously. We deduce symmetry relations for the number of faces, number of vertices and number of circles of certain orders. These symmetry relations are independent of the position of the sites in S. As a consequence we show that the reduced Euler characteristic of the po...
متن کاملPoset Pinball, Highest Forms, and (n-2, 2) Springer Varieties
In this manuscript we study type A nilpotent Hessenberg varieties equipped with a natural S1-action using techniques introduced by Tymoczko, Harada-Tymoczko, and Bayegan-Harada, with a particular emphasis on a special class of nilpotent Springer varieties corresponding to the partition λ = (n− 2, 2) for n ≥ 4. First we define the adjacent-pair matrix corresponding to any filling of a Young diag...
متن کاملΔ1-completions of a Poset
A join-completion of a poset is a completion for which each element is obtainable as a supremum, or join, of elements from the original poset. It is well known that the join-completions of a poset are in one-to-one correspondence with the closure systems on the lattice of up-sets of the poset. A ∆1-completion of a poset is a completion for which, simultaneously, each element is obtainable as a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae - General Algebra and Applications
سال: 2021
ISSN: 1509-9415,2084-0373
DOI: 10.7151/dmgaa.1358